Pseudofinite counting functions mod n

نویسنده

  • Will Johnson
چکیده

An Euler characteristic χ is definable if for every definable function f : X → Y and every r ∈ R, the set {y ∈ Y : χ(f−1(y)) = r} is definable. If R = Z/nZ and M is a finite structure, there is a (unique) Euler characteristic χ : Def(M) → Z/nZ assigning every set its size mod n. This χ is always strong and ∅definable. If M is an ultraproduct of finite structures, then there is a canonical strong Euler characteristic χ : Def(M) → Z/nZ coming from the ultraproduct. Specifically, if M is an ultraproduct ∏ i∈IMi/U , and X is a definable set in M of the form φ(M ; a), and a is the class of some tuple 〈ai〉i∈I ∈ ∏ i∈IMi, then take χ(X) to be the ultralimit of |φ(Mi; ai)| mod n. This limit Euler characteristic will always be strong, but need not be definable.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Depth Complexity of the Counting Functions

We use Karchmer and Wigderson’s recent characterization of circuit depth in terms of communication complexity to design shallow Boolean circuits for the counting functions. We show that the MOD, counting function on n arguments can be computed by Boolean networks which contain negations and binary ORand AND-gates in depth c logrn, where c A 2.881. This is an improvement over the obvious depth u...

متن کامل

Computing All MOD-Functions Simultaneously

The fundamental symmetric functions are EXk (equal to 1 if the sum of n input bits is exactly k), THk (the sum is at least k), and MODm,r (the sum is congruent to r modulo m). It is well known that all these functions and in fact any symmetric Boolean function have linear circuit size. Simple counting shows that the circuit complexity of computing n symmetric functions is Ω(n2−o(1)) for almost ...

متن کامل

ZETA FUNCTIONS AND COUNTING FINITE p-GROUPS

We announce proofs of a number of theorems concerning finite p-groups and nilpotent groups. These include: (1) the number of p-groups of class c on d generators of order pn satisfies a linear recurrence relation in n; (2) for fixed n the number of p-groups of order pn as one varies p is given by counting points on certain varieties mod p; (3) an asymptotic formula for the number of finite nilpo...

متن کامل

Pseudofinite groups with NIP theory and definability in finite simple groups

We show that any pseudofinite group with NIP theory and with a finite upper bound on the length of chains of centralisers is soluble-by-finite. In particular, any NIP rosy pseudofinite group is soluble-by-finite. This generalises, and shortens the proof of, an earlier result for stable pseudofinite groups. An example is given of an NIP pseudofinite group which is not soluble-by-finite. However,...

متن کامل

A ug 2 00 7 Arithmetic structures in smooth subsets of F p

Suppose S ⊆ ZN := Z/NZ, where N is a prime. A well-studied question for various types of sets S, is that of whether for a particular sequence of integers a1, ..., ad satisfying a1 + · · · + ad = 0, S contains solutions to the congruence a1s1 + · · ·+ adsd ≡ 0 (mod N). In particular, the question for d = 3 and a1 = a2 = 1 and a3 = −2 is that of whether or not S contains three-term arithmetic pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013